TSTP Solution File: CSR131^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR131^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:35 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 46 ( 6 unt; 14 typ; 0 def)
% Number of atoms : 109 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 457 ( 59 ~; 60 |; 27 &; 311 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 52 ( 0 ^ 46 !; 6 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_23,type,
lAnna_THFTYPE_i: $i ).
thf(decl_25,type,
lBill_THFTYPE_i: $i ).
thf(decl_26,type,
lBob_THFTYPE_i: $i ).
thf(decl_27,type,
lMary_THFTYPE_i: $i ).
thf(decl_28,type,
lSue_THFTYPE_i: $i ).
thf(decl_29,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_30,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_31,type,
n2009_THFTYPE_i: $i ).
thf(decl_32,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_33,type,
esk1_3: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i ).
thf(decl_34,type,
esk2_3: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i ).
thf(decl_35,type,
esk3_3: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i ).
thf(decl_36,type,
esk4_3: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p',ax_003) ).
thf(con,conjecture,
? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ~ ! [X4: $i,X5: $i] : ( X2 @ X4 @ X5 )
& ~ ! [X4: $i,X5: $i] : ( X1 @ X4 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p',con) ).
thf(ax_007,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p',ax_007) ).
thf(ax_009,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p',ax_009) ).
thf(ax_002,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p',ax_002) ).
thf(c_0_5,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_003]) ).
thf(c_0_6,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( ~ ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ~ ! [X4: $i,X5: $i] : ( X2 @ X4 @ X5 )
& ~ ! [X4: $i,X5: $i] : ( X1 @ X4 @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ~ ! [X4: $i,X5: $i] : ( X2 @ X4 @ X5 )
& ~ ! [X4: $i,X5: $i] : ( X1 @ X4 @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_7,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X9: $i > $i > $o,X10: $i > $i > $o,X11: $i,X16: $i,X17: $i,X18: $i,X19: $i] :
( ( ~ ( X10 @ X11 @ lBill_THFTYPE_i )
| ~ ( X9 @ X11 @ lAnna_THFTYPE_i )
| ( X10 @ X16 @ X17 )
| ( X9 @ X18 @ X19 )
| ( X10 @ X11 @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X10 @ X11 @ lBill_THFTYPE_i ) )
& ( ~ ( X10 @ X11 @ lBill_THFTYPE_i )
| ~ ( X9 @ X11 @ lAnna_THFTYPE_i )
| ( X10 @ X16 @ X17 )
| ( X9 @ X18 @ X19 )
| ( X9 @ X11 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X9 @ X11 @ lAnna_THFTYPE_i ) )
& ( ~ ( X10 @ X11 @ lBill_THFTYPE_i )
| ~ ( X9 @ X11 @ lAnna_THFTYPE_i )
| ( X10 @ X16 @ X17 )
| ( X9 @ X18 @ X19 )
| ~ ( X10 @ ( esk1_3 @ X9 @ X10 @ X11 ) @ ( esk2_3 @ X9 @ X10 @ X11 ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X10 @ ( esk1_3 @ X9 @ X10 @ X11 ) @ ( esk2_3 @ X9 @ X10 @ X11 ) ) )
& ( ~ ( X10 @ X11 @ lBill_THFTYPE_i )
| ~ ( X9 @ X11 @ lAnna_THFTYPE_i )
| ( X10 @ X16 @ X17 )
| ( X9 @ X18 @ X19 )
| ~ ( X9 @ ( esk3_3 @ X9 @ X10 @ X11 ) @ ( esk4_3 @ X9 @ X10 @ X11 ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X9 @ ( esk3_3 @ X9 @ X10 @ X11 ) @ ( esk4_3 @ X9 @ X10 @ X11 ) ) )
& ( ~ ( X10 @ X11 @ lBill_THFTYPE_i )
| ~ ( X9 @ X11 @ lAnna_THFTYPE_i )
| ( X10 @ X16 @ X17 )
| ( X9 @ X18 @ X19 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
thf(c_0_9,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i > $i > $o,X3: $i] :
( ( X1 @ X3 @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,axiom,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_007]) ).
thf(c_0_12,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_17,negated_conjecture,
! [X11: $i,X1: $i > $i > $o,X2: $i > $i > $o,X8: $i,X5: $i,X4: $i,X3: $i] :
( ( X1 @ X4 @ X5 )
| ( X2 @ X8 @ X11 )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i )
| ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_18,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_20,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_009])]) ).
thf(c_0_21,negated_conjecture,
! [X4: $i,X8: $i,X5: $i,X3: $i,X2: $i > $i > $o,X1: $i > $i > $o,X11: $i] :
( ( X1 @ X3 @ X4 )
| ( X2 @ X5 @ X8 )
| ~ ( X1 @ X11 @ lAnna_THFTYPE_i )
| ~ ( X2 @ X11 @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).
thf(c_0_22,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_23,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_002])]) ).
thf(c_0_24,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X4: $i,X3: $i,X8: $i,X5: $i,X1: $i > $i > $o] :
( ( parent_THFTYPE_IiioI @ X3 @ X4 )
| ( X1 @ X5 @ X8 )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i,X4: $i,X5: $i,X8: $i] :
( ( likes_THFTYPE_IiioI @ X3 @ X4 )
| ( parent_THFTYPE_IiioI @ X5 @ X8 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
thf(c_0_29,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i,X4: $i] : ( parent_THFTYPE_IiioI @ X3 @ X4 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19]) ).
thf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : CSR131^1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n003.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 15:10:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.QVUJYvqWyA/E---3.1_28302.p
% 0.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_11 with 1500s (5) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # Starting new_ho_9 with 300s (1) cores
% 0.16/0.44 # Starting ho_unfolding_4 with 300s (1) cores
% 0.16/0.44 # new_ho_9 with pid 28384 completed with status 0
% 0.16/0.44 # Result found by new_ho_9
% 0.16/0.44 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_11 with 1500s (5) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # Starting new_ho_9 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGHNF-FFMM32-SSSFFSBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # new_ho_10 with pid 28390 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_11 with 1500s (5) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # Starting new_ho_9 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGHNF-FFMM32-SSSFFSBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 23
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 42
% 0.16/0.44 # Removed in clause preprocessing : 14
% 0.16/0.44 # Initial clauses in saturation : 28
% 0.16/0.44 # Processed clauses : 68
% 0.16/0.44 # ...of these trivial : 1
% 0.16/0.44 # ...subsumed : 5
% 0.16/0.44 # ...remaining for further processing : 62
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 5
% 0.16/0.44 # Backward-rewritten : 19
% 0.16/0.44 # Generated clauses : 19
% 0.16/0.44 # ...of the previous two non-redundant : 19
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 17
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 16
% 0.16/0.44 # ...of those cached : 6
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 8
% 0.16/0.44 # Positive orientable unit clauses : 5
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 2
% 0.16/0.44 # Current number of unprocessed clauses: 4
% 0.16/0.44 # ...number of literals in the above : 14
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 54
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 156
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 125
% 0.16/0.44 # Non-unit clause-clause subsumptions : 6
% 0.16/0.44 # Unit Clause-clause subsumption calls : 29
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 10
% 0.16/0.44 # BW rewrite match successes : 10
% 0.16/0.44 # Condensation attempts : 73
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 2490
% 0.16/0.44 # Search garbage collected termcells : 212
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.007 s
% 0.16/0.44 # Maximum resident set size: 1736 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.010 s
% 0.16/0.44 # Maximum resident set size: 1728 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------